Probabilities of Sentences about Very Sparse Random Graphs
نویسنده
چکیده
W e consider random graphs with edge probability Pn-Q, where n is the number of vertices of the graph, /3 > 0 is fixed, and a = 1 or a = (I + 1)/1 for some fixed positive integer I . We prove that for every firstorder sentence, the probability that the sentence is true for the random graph has an asymptotic limit. Also, there is an eflective procedure for generating the value of the limit in closed form.
منابع مشابه
Network Discovery by Generalized Random Walks
We investigate network exploration by random walks defined via stationary and adaptive transition probabilities on large graphs. We derive an exact formula valid for arbitrary graphs and arbitrary walks with stationary transition probabilities (STP), for the average number of discovered edges as function of time. We show that for STP walks site and edge exploration obey the same scaling∼ n as f...
متن کاملOn limits of sparse random graphs
We present a notion of convergence for sequences of finite graphs {Gn} that can be seen as a generalization of the Benjamini-Schramm convergence notion for bounded degree graphs, regarding the distribution of r-neighbourhoods of the vertices, and the left-convergence notion for dense graphs, regarding, given any finite graph F , the limit of the probabilities that a random map from V (F ) to V ...
متن کاملRandom dense bipartite graphs and directed graphs with specified degrees
Let s and t be vectors of positive integers with the same sum. We study the uniform distribution on the space of simple bipartite graphs with degree sequence s in one part and t in the other; equivalently, binary matrices with row sums s and column sums t. In particular, we find precise formulae for the probabilities that a given bipartite graph is edge-disjoint from, a subgraph of, or an induc...
متن کاملLimit Probabilities for Random Sparse Bit Strings
Let n be a positive integer, c a real positive constant, and p(n) = c/n. Let Un,p be the random unary predicate under the linear order, and Sc the almost sure theory of Un, c n . We show that for every first-order sentence φ: fφ(c) = lim n→∞Pr[Un, c n has property φ] is an infinitely differentiable function. Further, let S = ⋂ c Sc be the set of all sentences that are true in every almost sure ...
متن کاملSparse random graphs: regularization and concentration of the Laplacian
We study random graphs with possibly different edge probabilities in the challenging sparse regime of bounded expected degrees. Unlike in the dense case, neither the graph adjacency matrix nor its Laplacian concentrate around their expectations due to the highly irregular distribution of node degrees. It has been empirically observed that simply adding a constant of order 1/n to each entry of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990